Probabilistically checkable proof

Results: 138



#Item
21Applied research, post-graduate training and expertise by RP-PCP: Accompanying programs in agriculture and conservation in Zimbabwe Who we are: The Research Platform “Production and Conservation in Partnership” (RP-P

Applied research, post-graduate training and expertise by RP-PCP: Accompanying programs in agriculture and conservation in Zimbabwe Who we are: The Research Platform “Production and Conservation in Partnership” (RP-P

Add to Reading List

Source URL: afrique-orientale-australe.cirad.fr

Language: English - Date: 2014-10-16 08:21:42
22Self Assessment Tool Partnership Expectations Working together from within our agency

Self Assessment Tool Partnership Expectations Working together from within our agency

Add to Reading List

Source URL: www.eastgippslandpcp.com.au

Language: English - Date: 2014-12-08 23:25:19
23The Polyhedral Compilation Package �P

The Polyhedral Compilation Package P

Add to Reading List

Source URL: www.grosser.es

Language: English - Date: 2010-07-25 08:26:30
24Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010

Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010

Add to Reading List

Source URL: www.stanford.edu

Language: English - Date: 2010-05-04 16:48:34
25Improved Soundness for QMA with Multiple Provers

Improved Soundness for QMA with Multiple Provers

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2013-01-14 01:47:53
26A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick†  Abstract

A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract

Add to Reading List

Source URL: www.quantum-lab.org

Language: English - Date: 2014-11-28 23:31:17
27— A merged version of this work and the work of [BGW12] appears in the proceedings of the Theory of Cryptography Conference - TCC 2013 — On the (In)security of the Fiat-Shamir Paradigm, Revisited Dana Dachman-Soled M

— A merged version of this work and the work of [BGW12] appears in the proceedings of the Theory of Cryptography Conference - TCC 2013 — On the (In)security of the Fiat-Shamir Paradigm, Revisited Dana Dachman-Soled M

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-12-17 13:39:52
28How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗

How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-05-01 02:12:54
29Succinct Non-Interactive Arguments via Linear Interactive Proofs Nir Bitansky∗ Tel Aviv University Alessandro Chiesa MIT

Succinct Non-Interactive Arguments via Linear Interactive Proofs Nir Bitansky∗ Tel Aviv University Alessandro Chiesa MIT

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2013-09-15 12:03:01
30An extended abstract of this paper is published in the proceedings of the 13th International Conference on Cryptology in India [21] – IndocryptThis is the full version. On the Non-malleability of the Fiat-Shamir

An extended abstract of this paper is published in the proceedings of the 13th International Conference on Cryptology in India [21] – IndocryptThis is the full version. On the Non-malleability of the Fiat-Shamir

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-12-16 15:16:50